# recursion

def f(n):
    if n <= 1:
        return 1
    return n + f(n - 1)


def r(n):
    if n == 5:
        return
    print('--begin recursing for', n)
    r(n + 1)
    print('--end recursing for', n)


def fibonacci(n):
    if n == 1:
        return 1
    if n == 2:
        return 1
    a = fibonacci(n - 1)
    b = fibonacci(n - 2)
    print(a)
    print(b)
    return a+b


if __name__ == '__main__':
    # print(f(100))
    r(1)
    # print(fibonacci(2))
